Integrating Interval Constraints into Logic Programming

The clp scheme uses Horn clauses and sld resolution to generate multiple constraint satisfaction problems (csps). The possible csps include rational trees (giving Prolog) and numerical algorithms for solving linear equations and linear programs (giving clp(r)). In this paper we develop a form of csp for interval constraints. In this way one obtains a logic semantics for the efficient floating-point hardware that is available on most computers. The need for the method arises because in the practice of scheduling and engineering design it is not enough to solve a single csp. Ideally one should be able to consider thousands of csps and efficiently solve them or show them to be unsolvable. This is what clp/ncsp, the new subscheme of clp described in this paper is designed to do.